Digital straight line segments and curves
نویسندگان
چکیده
منابع مشابه
Applications of Digital Straight Segments to Economical Image Encoding
A new classification of digital curves into boundary curves and visual curves of different thickness is suggested. A fast algorithm for recognizing digital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.
متن کاملOn the Length Estimation of Digital Curves
The paper details two linear-time algorithms, one for the partition of the boundary line of a digital region into digital straight segments, and one for calculating the minimum length polygon within a simple open boundary of a digital region. Both techniques allow the estimation of the length of digital curves or the perimeter of digital regions due to known multigrid convergence theorems. The ...
متن کاملAlgorithms in Digital Geometry Based on Cellular Topology
The paper presents some algorithms in digital geometry based on the topology of cell complexes. The paper contains an axiomatic justification of the necessity of using cell complexes in digital geometry. Algorithms for solving the following problems are presented: tracing of curves and surfaces, recognition of digital straight line segments (DSS), segmentation of digital curves into longest DSS...
متن کاملComputing Mitered Offset Curves Based on Straight Skeletons
We study the practical computation of mitered and beveled offset curves of planar straight-line graphs (PSLGs), i.e., of arbitrary collections of straight-line segments in the plane that do not intersect except possibly at common end points. The line segments can, but need not, form polygons. Similar to Voronoi-based offsetting, we propose to compute a straight skeleton of the input PSLG as a p...
متن کاملAn Arithmetical Characterization of the Convex Hull of Digital Straight Segments
In this paper, we arithmetically describe the convex hull of a digital straight segment by three recurrence relations. This characterization gives new insights into the combinatorial structure of digital straight segments of arbitrary length and intercept. It also leads to two on-line algorithms that computes a part of the convex hull of a given digital straight segment. They both run in consta...
متن کامل